Similarity dimension for IFS-attractors
نویسندگان
چکیده
Moran’s Theorem is one of the milestones in Fractal Geometry. It allows the calculation of the similarity dimension of any (strict) self-similar set lying under the open set condition. Throughout a new fractal dimension we provide in the context of fractal structures, we generalize such a classical result for attractors which are required to satisfy no separation properties.
منابع مشابه
Analysis of the convex hull of the attractor of an IFS
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) compact fixed sets of self-similarity mapping: K = ⋃ i=1..n Ai(K) + ti (1) where Ai are some contracting, linear mappings. The method is based on a function which for a direction, gives width in that direction. We can write the self similarity equation in terms o...
متن کاملA Fractal Dimension Estimate for a Graph-directed Iterated Function System of Non-similarities
Suppose a graph-directed iterated function system consists of maps fe with upper estimates of the form d ( fe(x),fe(y) ) ≤ red(x,y). Then the fractal dimension of the attractor Kv of the IFS is bounded above by the dimension associated to the Mauldin–Williams graph with ratios re. Suppose the maps fe also have lower estimates of the form d ( fe(x),fe(y) ) ≥ r′ ed(x,y) and that the IFS also sati...
متن کاملDimensions of Points in Self-similar Fractals
Self-similar fractals arise as the unique attractors of iterated function systems (IFSs) consisting of finitely many contracting similarities satisfying an open set condition. Each point x in such a fractal F arising from an IFS S is naturally regarded as the “outcome” of an infinite coding sequence T (which need not be unique) over the alphabet Σk = {0, . . . , k − 1}, where k is the number of...
متن کاملTime-delay Embeddings of Ifs Attractors
A modified type of iterated function system (IFS) has recently been shown to generate images qualitatively similar to “classical” chaotic attractors. Here, we use time-delay embedding reconstructions of time-series from this system to generate three-dimentional projections of IFS attractors. These reconstructions may be used to access the topological structure of the periodic orbits embedded wi...
متن کاملApproximate convex hull of affine iterated function system attractors
In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Intelligent and Fuzzy Systems
دوره 33 شماره
صفحات -
تاریخ انتشار 2017